Scalability of Avoidance-Based Transactional Cache Coherency
نویسنده
چکیده
The scalability of cache coherency schemes plays a major role in the overall performance of any scalable distributed system that utilises client data caching. In particular, transactional cache coherency algorithms must be scalable if the systems that are built around them, such as persistent object stores, are to be scalable. The avoidance-based transactional cache coherency [Hughes 1998] algorithm PS-AA [Carey et al. 1994] was used as the basis of an investigation into such scalability. This particular algorithm was chosen as it is considered the state of the art in avoidance-based algorithms. This paper discusses the PS-AA algorithm, presents the scalability experiments and examines the results that were obtained.
منابع مشابه
Scalable Transactional Cache Coherency: Towards Scalable Persistent Systems
This paper reports on the development of a scalable storage layer to be used as a foundation for the development of scalable persistent programming environments and objectoriented databases. We identify the challenges associated with the construction of such a storage layer and report on progress in each of these areas. Detailed results of recent experiments on scalable transactional cache cohe...
متن کاملIp - Esc ’ 11 Co - Designed Cache Coherency Architecture for Embedded Multicore Systems
One of the key challenges in chip multi-processing is to provide a programming model that manages cache coherency in a transparent and efficient way. A large number of applications designed for embedded systems are known to read and write data following memory access patterns. Memory access patterns can be used to optimize cache consistency by prefetching data and reducing the number of memory ...
متن کاملThe Transactional Object Cache: A Foundation for High Performance Persistent System Construction
This paper argues that caching, atomicity and layering are fundamental to persistent systems, and that the transactional object cache architecture, as an embodiment of these concerns, provides a foundation for high performance persistent system construction. Central to the paper is a description of the semantics of an abstract transactional object cache architecture that supports a wide range o...
متن کاملHardware Support for Unbounded Transactional Memory
In this thesis, I propose a design for hardware transactional memory where the transaction size is not bounded by a specialized hardware buffer such as a cache. I describe an unbounded transactional memory system called UTM (unbounded transactional memory) that exploits the perceived common case where transactions are small but still supports transactions of arbitrary size. As in previous hardw...
متن کاملA Locally Cache-Coherent Multiprocessor Architecture
Recently there has been considerable interest in cache coherency protocols in shared-memory multiprocessor systems, particularly in protocols which are scalable, i.e. suitable for very large systems. However, cache coherency scalability (CCS) entails heavy performance overhead and system cost, so a critical examination of the assumptions underlying the quest for CCS is undertaken here. A non-CC...
متن کامل